CSC 2414 : Discrepancy Theory in Computer Science Fall 2015 Lecture 2 — September 20 , 2015
نویسندگان
چکیده
Estimating a complicated integral numerically is a problem which is ubiquitous in applied mathematics. Often we have to deal with functions for which the integral has no simple closed form. Even worse, often we do not even have a formula for the function we are integrating, and instead can only query its value at specific points, for example by performing an experiment. We might, however, have some knowledge about the function, for example that it is bounded or somewhat smooth.
منابع مشابه
CSC 2414 : Discrepancy Theory in Computer Science Fall 2015 Lecture 6 — October 26 th , 2015
We have seen in previous lectures that matrix discrepancy generalizes normal combinatorial discrepancy (if F is a set system with m sets, take A to be the 0-1 incidence matrix of F , and the ±1 vector x is the colouring of the underlying elements), which means that the study of disc(A) is particularly interesting when the entries of A are bounded in the interval [−1, 1]. In this regime we can g...
متن کاملMath 322: Introduction to Group Theory Lecture Notes
These are rough notes for the Fall 2015 course. Solutions to problem sets were posted on an internal website.
متن کاملEECS 598 - 005 : Theoretical Foundations of Machine Learning Fall 2015 Lecture 15 : Neural Networks Theory
متن کامل
Probability Theory 1 Lecture Notes
These lecture notes were written for MATH 6710 at Cornell University in the Fall semester of 2013. They were revised in the Fall of 2015 and the schedule on the following page re ects that semester. These notes are for personal educational use only and are not to be published or redistributed. Almost all of the material, much of the structure, and some of the language comes directly from the co...
متن کاملLeakage-Resilient Symmetric Cryptography
. In Moni Naor, editor, Theory of Cryptography, First Theory of Cryp-tography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004,Proceedings, volume 2951 of Lecture Notes in Computer Science, pages 278–296.Springer, 2004.55. Andrew Moss, Elisabeth Oswald, Dan Page, and Michael Tunstall. Compiler assisted masking. In Prouff and Schaumont [66], pages 58–75.56. Moni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015